VC-Dimension of a Context-Dependent Perceptron
نویسنده
چکیده
Ciekawym, czy pjd polskie znaczki: .
منابع مشابه
On the VC-dimension of neural networks with binary weights
We investigate the VC-dimension of the perceptron and simple two-layer networks like the committeeand the parity-machine with weights restricted to values ±1. For binary inputs, the VC-dimension is determined by atypical pattern sets, i.e. it cannot be found by replica analysis or numerical Monte Carlo sampling. For small systems, exhaustive enumerations yield exact results. For systems that ar...
متن کاملVapnik-Chervonenkis dimension of neural networks with binary weights
We investigate the Vapnik-Chervonenkis ~VC! dimension of the perceptron and simple two-layer networks such as the committee and the parity machine with weights restricted to values 61. For binary inputs, the VC dimension is determined by atypical pattern sets, i.e., it cannot be found by replica analysis or numerical Monte Carlo sampling. For small systems, exhaustive enumerations yield exact r...
متن کاملSublinear Models for Graphs
This contribution extends linear models for feature vectors to sublinear models for graphs and analyzes their properties. The results are (i) a geometric interpretation of sublinear classifiers, (ii) a generic learning rule based on the principle of empirical risk minimization, (iii) a convergence theorem for the margin perceptron in the sublinearly separable case, and (iv) the VC-dimension of ...
متن کاملCOMS 4771 : Homework 2 Solution
f(x) = { 1 if wx+ b > 0, −1 otherwise. Consider d+1 points x = (0, ..., 0) , x = (1, 0, ..., 0) , x = (0, 1, ..., 0) , ..., x = (0, 0, ..., 1) . After these d+1 points being arbitrarily labeled: y = (y0, y1, ..., yd) T ∈ {−1, 1}. Let b = 0.5 · y0 and w = (w1, w2, ...wd) where wi = yi, i ∈ {1, 2, ..., d}. Thus f(x) can label all these d+ 1 points correctly. So the VC dimension of perceptron is a...
متن کاملOn the Vapnik–Chervonenkis dimension of the Ising perceptron
The Vapnik–Chervonenkis (VC) dimension of the Ising perceptron with binary patterns is calculated by numerical enumerations for system sizes N 6 31. It is significantly larger than 1 2N . The data suggest that there is probably no well-defined asymptotic behaviour for N → ∞. The Vapnik–Chervonenkis (VC) dimension is one of the central quantities used in both mathematical statistics and computer...
متن کامل